A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation
نویسندگان
چکیده
We present a core Martin-Löf type theory with subtyping; it has a cumulative hierarchy of universes and the contravariant rule for subtyping between dependent product types. We extend to this calculus the normalisation by evaluation technique defined for a variant of MLTT without subtyping. This normalisation function makes the subtyping relation and type-checking decidable. To our knowledge, this is the first time that the normalisation by evaluation technique has been considered in the context of subtypes, which introduce some subtleties in the proof of correctness of NbE; an important result to prove correctness and completeness of type-checking.
منابع مشابه
Normalization by Evaluation for Martin-Löf Type Theory with One Universe
We present an algorithm for computing normal terms and types in Martin-Löf type theory with one universe and eta-conversion. We prove that two terms or types are equal in the theory iff the normal forms are identical (as de Bruijn terms). It thus follows that our algorithm can be used for deciding equality in Martin-Löf type theory. The algorithm uses the technique of normalization by evaluatio...
متن کاملQuotient types in type theory
Martin-Löf’s intuitionistic type theory (Type Theory) is a formal system that serves not only as a foundation of constructive mathematics but also as a dependently typed programming language. Dependent types are types that depend on values of other types. Type Theory is based on the Curry-Howard isomorphism which relates computer programs with mathematical proofs so that we can do computer-aide...
متن کاملVerifying a Semantic βη-Conversion Test for Martin-Löf Type Theory (extended version)
Type-checking algorithms for dependent type theories often rely on the interpretation of terms in some semantic domain of values when checking equalities. Here we analyze a version of Coquand’s algorithm for checking the βη-equality of such semantic values in a theory with a predicative universe hierarchy and large elimination rules. Although this algorithm does not rely on normalization by eva...
متن کاملA Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluation algorithm. We prove completeness and soundness of the algorithm; and get as a corollary the injectivity of type constructors. Then we give the definition of a correct and complete type-checking algorithm for terms ...
متن کاملCoherence Checking of Coercions in Plastic
Coercive Subtyping is a conceptually simple but powerful framework for subtyping in type theory. Recent work in Durham by Luo et al. on Coercive Subtyping has been partially implemented in the proof assistant`Plastic'. Plastic is an implementation of a variant of Martin-LL of's LF with inductive types, universes, and coercive subtyping. After discussing background theory and then the implementa...
متن کامل